Lookahead and Piloting Strategies for Variable Selection

نویسندگان

  • Junni L. Zhang
  • Ming T. Lin
  • Jun S. Liu
  • Rong Chen
  • JUNNI L. ZHANG
  • MING T. LIN
  • JUN S. LIU
  • RONG CHEN
چکیده

The traditional variable selection problem has attracted renewed attention from statistical researchers due to the recent advances in data collection, especially in fields such as bioinformatics and marketing. In this paper, we formulate regression variable selection as an optimization problem, propose and study several deterministic and stochastic sequential optimization methods with lookahead. Using several synthetic examples, we show that the stochastic sequential method with lookahead robustly and significantly outperforms a few close competitors, including the popular stepwise methods. When applied to analyze a yeast amino acid starvation microarray experiment, this method can find many transcription factors that are known to be important for yeast to cope with stress and starvation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Method for Solving Constraint Satisfaction Problems

Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...

متن کامل

A New Method for Solving Constraint Satisfaction Problems

Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...

متن کامل

Towards a Lookahead Sat Solver for General Purposes towards a Lookahead Sat Solver for General Purposes

The DPLL framework with a lookahead procedure that determines the branching variable is a powerful tandem to solve a wide range of satisfiability problems. It outperforms all other techniques on random CNF formulas. This thesis presents the solver march, which is based on this architecture and focuses on general fast performance. To achieve this goal, this thesis proposes a new kind of pre-sele...

متن کامل

Applying Variable Deletion Strategies in Bankruptcy Studies to Capture Common Information and Increase Their Reality

In financial distress studies selection of variable is commonly basedon the success of variables in variable sets employed in earlierbankruptcy studies, suggestions in the literature or an accompanyingdata reduction in a large set of variables. If seemingly different variablesets exhibit a strong relationship then heterogeneous variable setscapture common information. Canonical correlation anal...

متن کامل

Specification Coverage Aided Test Selection

In this paper test selection strategies in formal conformance testing are considered. As the testing conformance relation we use the ioco relation, and extend the previously presented on-the-fly test generation algorithms for ioco to include test selection heuristic based on a specification coverage metric. The proposed method combines a greedy test selection with randomization to guarantee com...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007